import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        int[] res = new int[278];
        int count = 0;
        for (int i = 1; i <= 10000000; i++) {
            int[] array = new int[10];
            int n = i;
            boolean flag = true;
            while(n != 0){
                array[n % 10]++;
                n/=10;
            }
            for (int j = 0; j < 10; j++) {
                if(array[j] != 0 && array[j] != j){
                    flag = false;
                    break;
                }
            }
            if(flag){
                res[count++] = i;
            }
        }
        System.out.println(Arrays.toString(res));
        System.out.println(count);
    }
}

class Solution {
    public int nextBeautifulNumber(int n) {
        int[] res = new int[]{1, 22, 122, 212, 221, 333, 1333, 3133, 3313,
                3331, 4444, 14444, 22333, 23233, 23323, 23332, 32233, 32323,
                32332, 33223, 33232, 33322, 41444, 44144, 44414, 44441, 55555,
                122333, 123233, 123323, 123332, 132233, 132323, 132332, 133223,
                133232, 133322, 155555, 212333, 213233, 213323, 213332, 221333,
                223133, 223313, 223331, 224444, 231233, 231323, 231332, 232133,
                232313, 232331, 233123, 233132, 233213, 233231, 233312, 233321,
                242444, 244244, 244424, 244442, 312233, 312323, 312332, 313223,
                313232, 313322, 321233, 321323, 321332, 322133, 322313, 322331,
                323123, 323132, 323213, 323231, 323312, 323321, 331223, 331232,
                331322, 332123, 332132, 332213, 332231, 332312, 332321, 333122,
                333212, 333221, 422444, 424244, 424424, 424442, 442244, 442424,
                442442, 444224, 444242, 444422, 515555, 551555, 555155, 555515,
                555551, 666666, 1224444};
        for (int i = 0; i < res.length; i++) {
            if(res[i] > n){
                return res[i];
            }
        }
        return 0;
    }
}


//import java.util.Scanner;
//
//public class Main {
//    public static void main(String[] args) {
//        Scanner scanner = new Scanner(System.in);
//        int n = scanner.nextInt();
//
//        Solution solution = new Solution();
//        System.out.println(solution.nextBeautifulNumber(n));
//    }
//}
//
//class Solution {
//    public int nextBeautifulNumber(int n) {
//        while(true){
//            n++;
//            int m = n;
//            int[] array = new int[10];
//            boolean flag = true;
//            while(m != 0){
//                array[m % 10]++;
//                m/=10;
//            }
//            for (int j = 0; j < 10; j++) {
//                if(array[j] != 0 && array[j] != j){
//                    flag = false;
//                    break;
//                }
//            }
//            if(flag){
//                return n;
//            }
//        }
//    }
//}